|
In computer networking, if a network is segmented into two equal parts, this is the bandwidth between the two parts. Typically, this refers to the worst-case segmentation, but being of equal parts is critical to the definition, as it refers to an actual bisection of the network. Theoretical support for the importance of this measure of network performance was developed in the PhD research of (Clark Thomborson (formerly Clark Thompson) ). Thomborson proved that important algorithms such as sorting, fast Fourier transformation, and matrix-matrix multiplication become communication-limited—as opposed to CPU-limited or memory-limited—on computers with insufficient bisection width. F. Thomson Leighton's PhD research tightened Thomborson's loose bound on the bisection width of a computationally-important variant of the De Bruijn graph known as the shuffle-exchange graph. Bill Dally analyzed the latency, average case throughput, and hot-spot throughput of k-ary n-cube networks for various k, determining that low-dimensional networks (e.g., tori) have lower latency and higher hot-spot throughput than high-dimensional networks (e.g., binary n-cubes) with the same bisection width. ==References== 〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Bisection bandwidth」の詳細全文を読む スポンサード リンク
|